package 竞赛.NO_398;

/**
 * 描述：
 *
 * @author lanran
 * @date 2024/5/19 10:30
 **/
public class 特殊数组I_100310 {
    static class Solution {
        public boolean isArraySpecial(int[] nums) {
            for (int i = 0; i < nums.length - 1; i++) {
                if (nums[i] % 2 == nums[i + 1] % 2) {
                    return false;
                }
            }
            return true;
        }
    }
}
